GATE CSE 1996


Q11.

Suppose X and Y are sets and |X| and |Y| are their respective cardinality. It is given that there are exactly 97 functions from X to Y. From this one can conclude that
GateOverflow

Q12.

Let R denote the set of real numbers. Let f:R\times R \rightarrow R \times R be a bijective function defined by f(x,y) = (x+y, x-y). The inverse function of f is given by
GateOverflow

Q13.

Which of the following statements is FALSE?
GateOverflow

Q14.

Which one of the following is false?
GateOverflow

Q15.

An advantage of chained hash table (external hashing) over the open addressing scheme is
GateOverflow

Q16.

The minimum number of interchanges needed to convert the array into a max-heap is 89, 19, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70
GateOverflow

Q17.

Consider the circuit in below figure which has a four bit binary number b_3b_2b_1b_0 as input and a five bit binary number, d_4d_3d_2d_1d_0 as output.
GateOverflow

Q18.

Consider the circuit in figure. f implements
GateOverflow

Q19.

For the daisy chain scheme of connecting I/O devices, which of the following statements is true?
GateOverflow

Q20.

The pass numbers for each of the following activities i. object code generation ii. literals added to literal table iii. listing printed iv. address resolution of local symbols that occur in a two pass assembler respectively are
GateOverflow